#include <iostream>
#include <queue>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <deque>
#include <map>
using namespace std;
const int maxn = 1e5 + 7;
int n, r[maxn], ans;
deque <int> q;
int main(){
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n; i++){
        std::scanf("%d", &r[i]);
    }
    sort(r+1, r+n+1);
    q.push_back(r[1]);
    for(int i = 2; i <= n; i++){
        if(q.front() < r[i]) q.pop_front();
        q.push_back(r[i]);
    }
    printf("%d", q.size());
    return 0;
}
